A mean identity for longest increasing subsequence problems
نویسنده
چکیده
We show that a wide variety of generalized increasing subsequence problems admit a one parameter family of extensions for which we can exactly compute the mean length of the longest increasing subsequence. By the nature of the extension, this gives upper bounds on the mean in the unextended model, which turn out to be asymptotically tight for all of the models that have so far been analyzed. A heuristic analysis based on this fact gives not just the asymptotic mean but also the asymptotic scale factor, again agreeing with all known cases.
منابع مشابه
Non-universality for longest increasing subsequence of a random walk
The longest increasing subsequence of a random walk with mean zero and finite variance is known to be n1/2+o(1). We show that this is not universal for symmetric random walks. In particular, the symmetric fat-tailed random walk has a longest increasing subsequence that is asymptotically at least n0.690 and at most n0.815. An exponent strictly greater than 1/2 is also shown for the symmetric sta...
متن کاملOn Some Variants of the Longest Increasing Subsequence Problem
The problem of finding a longest increasing subsequence (LIS) is a well known task in sequence processing. There are many variants of the basic task. We discuss a recently introduced variant of LIS, a minimal height longest increasing subsequence problem and propose a new algorithm for it, which improves its time complexity. Moreover, we define a family of similar problems and introduce algorit...
متن کاملGeneralizations and Variants of the Largest Non-crossing Matching Problem in Random Bipartite Graphs
A two-rowed array αn = ( a1 a2 . . . an b1 b2 . . . bn ) is said to be in lexicographic order if ak ≤ ak+1 and bk ≤ bk+1 if ak = ak+1. A length ` (strictly) increasing subsequence of αn is a set of indices i1 < i2 < . . . < i` such that bi1 < bi2 < . . . < bi` . We are interested in the statistics of the length of the longest increasing subsequence of αn chosen according to Dn, for distinct fam...
متن کاملA Load Balancing Technique for Some Coarse-Grained Multicomputer Algorithms
The paper presents a load balancing method for some CGM (Coarse-Grained Multicomputer) algorithms. This method can be applied on different dynamic programming problems such as: Longest Increasing Subsequence, Longest Common Subsequence, Longest Repeated Suffix Ending at each point in a word and Detection of Repetitions. We present also experimental results showing that our method is efficient.
متن کاملLongest Alternating Subsequences of Permutations
The length is(w) of the longest increasing subsequence of a permutation w in the symmetric group Sn has been the object of much investigation. We develop comparable results for the length as(w) of the longest alternating subsequence of w, where a sequence a, b, c, d, . . . is alternating if a > b < c > d < · · · . For instance, the expected value (mean) of as(w) for w ∈ Sn is exactly (4n + 1)/6...
متن کامل